// 反转链表

function reverse(head) {
if(head == null || head.next === null) return head
let last = reverse(head.next)
// 最深层的递归，head代表尾节点
head.next.next = head  // 5.next = 4
head.next = null
return last
}